Multiple choice tries and distributed hash tables
نویسندگان
چکیده
منابع مشابه
Distributed Paged Hash Tables
In this paper we present the design and implementation of DPH, a storage layer for cluster environments. DPH is a Distributed Data Structure (DDS) based on the distribution of a paged hash table. It combines main memory with file system resources across the cluster in order to implement a distributed dictionary that can be used for the storage of very large data sets with key based addressing t...
متن کامل7. Distributed Hash Tables
In the last few years, an increasing number of massively distributed systems with millions of participants has emerged within very short time frames. Applications, such as instant messaging, file-sharing, and content distribution have attracted countless numbers of users. For example, Skype gained more than 2.5 millions of users within twelve months, and more than 50% of Internet traffic is ori...
متن کاملPartial-Match Queries with Random Wildcards: In Tries and Distributed Hash Tables
Consider an m-bit query q to a bitwise trie T . A wildcard ∗ is an unspecified bit in q for which the query asks the membership in both cases ∗ = 0 and ∗ = 1. It is common that such partial-match queries with wildcards are issued in tries. With uniformly random occurrences of w wildcards in q assumed, the obvious upper bound on the average number of traversal steps in T is 2m. We show that the ...
متن کاملRange-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retrieving geographic data from a structured P2P network overlay. We have developed RDHTs as backend for the DART search engine, whose goal is to efficiently answer complex queries based on semantics and geographical conte...
متن کاملMulti-space distributed hash tables for multiple transport domains
The use of consistent hashing to construct a distributed hash table (DHT) has recently gained significant interest from the distributed computing community, particularly because algorithms have been devised which implement a DHT using peer-to-peer (P2P) technology. However a common assumption is that every node that participates in the DHT is within the same transport domain. Some solutions mak...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2009
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20234